perm filename INFO1[206,LSP] blob sn#238543 filedate 1976-10-16 generic text, type C, neo UTF8
COMMENT āŠ—   VALID 00003 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	CS 206							Page 1
C00006 00003
C00010 ENDMK
CāŠ—;
CS 206							Page 1
HANDOUT #1
09-30-76

			COURSE FACTS

Instructor:  John McCarthy
	     Usually at AI lab (497-4430) ;Polya 203 by appointment

TA:	     Chris Goad 	T,Th  14:30-17:00  (negotiable)
	     Polya 209  (497-4945)

Course meets:  T,Th 11:00-12:15
	       Polya 111

Course notes:  Cost $1.00 per student.  Payable in advance
	       to Polly Crandall in Polya 251 or to Chris Goad.
	       The notes will be passed out in class from time to time.

Texts:  Bobrow, Burton and Lewis,  UCI LISP Manual
	Qaum and Diffie, Stanford LISP 1.6 Manual (SAILON 28.6)
Optional:  Weissman, Clark, LISP 1.5 Primer

	Texts are available in the bookstore.

Computer:
	We will be using a PDP-10 belonging to IMSSS.
	We will be running a computer-assisted instruction
	program designed to teach LISP.  (This course
	is roughly equivalent to Weissman.)  The program
	will give you all the capabilities of UCI LISP,
	and various types of learning aids.
Terminals:
	Located on 2nd floor of Casita Hall (behind Ventura).
	There are 26 model 33 teletypes (sorry about that)
	and 6 display terminals.  Although the teletypes
	are the terminals intended for use by this course,
	we have obtained permission for students to use
	the display terminals also.  HOWEVER, YOU ARE LAST
	IN PRIORITY.  IF ANYBODY ELSE AT ALL WANTS TO USE
	THE DISPLAYS, YOU MUST GET OFF!  (Use a teletype
	instead.)

Hours:
	Tentatively, the terminal rooms will be unlocked
	M-TH 7:30-23:00.
	F 7:30-18:00
	SUN 13:00-17:00.
	Students inside at closing time may remain, but
	are not to admit anyone else. 

			COURSE BOOK LISTS		Page 2

    SAILON is an abbreviation for Stanford Artificial Intelligence 
Laboratory Operating Note; AIM abbreviates Artificial Intelligence
Memo.

On reserve:
    Allen, John R., SUPERLISP (Manuscript on LISP and its 
	implementations.)
    Baumgart, Bruce G., Micro Planner Alternate Reference Manual, 
	SAILON 67.
    Berkeley and Bobrow, eds., The Programming Language LISP:
        Its Operation and Applications, Information International, Inc.,
        Cambridge, Mass., 1964.
    Bobrow, Burton and Lewis, UCI LISP Manual, Reprinted from
        UC Irvine Information and Computer Science Technical Report	
        No. 21, October 1972.
    Bobrow and Raphael, New Programming Languages for AI Research,
        XEROX CSL-73-2.
    Friedman and Wise, An Environment for Multiple-Valued Recursive Procedures
	Indiana University Comp. Sci. Dept. Technical Report #40
    Friedman and Wise, Cons Should not Evaluate Its Arguments
	Indiana University Comp. Sci. Dept. Technical Report #44
    Henderson and Morris,  A Lazy Evaluator,
	Third ACM Symp on Prin. of Prog Lang.,95-103
    Maurer, The Programmer's Introduction to LISP, MacDonald/
        American Elsevier.
    McCarthy, John, et al, LISP 1.5 Programmer's Guide, MIT Press, 1962.
    Quam, Lynn and Diffie, Whit, Stanford LISP 1.6 Manual, SAILON 28.6.
    Siklossy, Let's Talk LISP, University of Texas manuscript.
    Smith, MLISP, AIM 135.
    Teitelman, et al, INTERLISP Reference Manual.
    Weissman, LISP 1.5 Primer, Dickenson, Belmont, CA., 1967.

Other publications about LISP, data structures, and other languages
used in AI:
    Hewitt, Description and Theoretical Analysis (Using Schemata)
        of Planner, MIT-AI Technical Report 258.
    London, Correctness of Two Compilers for a Lisp Subset, AIM-151,
        October 1971.
    McDermott and Sussman, The Coniver Reference Manual, MIT-AI
        Technical Report 259, May 1972.
    Rulifson, Derkson and Waldinger, QA4: A Procedural Calculus for
        Intuitive Reasoning, SRI-AIC Technical Note 73, Nov. 1972.